On Channel Codes for Short Underwater Messages
نویسندگان
چکیده
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملReverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages
Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...
متن کاملShort messages.
This paper has three purposes. The first one is to explain to a general audience what is involved in retrieving a web page or performing some other complex network transaction, and what can make it slow, and why the problem of slowness is likely to get worse as networked applications become more complex. The second is to describe, to those who program networked applications, certain facts that ...
متن کاملTEA: Episode Analytics on Short Messages
Twitter is a widely used micro-blogging service, which in recent times, has become a reliable source of happening news around the world [11]. Breaking news are covered in twitter; the magnitude and volumes of tweets reflecting on the nature and intensity of the news. During events, many tweets are posted either expressing sentiments about the event or just about the occurrence of the event. Eve...
متن کاملOn quantum interactive proofs with short messages
This paper proves one of the open problems posed by Beigi, Shor and Watrous in [ToC, Volume 7, Article 7, pp. 101–117, 2011]. We consider quantum interactive proof systems where, in the beginning, the verifier and prover send messages to each other, with the combined length of all messages being at most logarithmic (in the input length); and at the end, the prover sends a polynomial-length mess...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2020
ISSN: 2078-2489
DOI: 10.3390/info11020058